Integrating Disequations in the Algebraic and Logic Programming Language LPG
نویسندگان
چکیده
This paper gives a brief description of the recent improvements of the algebraic and logic programming language lpg. We mainly introduce the possibility to use disequa-tions (negation of equations), which involve user's deenable functions, in the deenition of predicates. Then we describe the operational semantics of lpg which is based on an extension of SLD?resolution in order to deal with equations and disequations. Also, we give new suucient conditions to ensure the completeness of narrowing strategies, to solve equations and disequations, in the presence of conditional term rewrite systems.
منابع مشابه
On the Operational Semantics of the Algebraic and Logic Programming Language LPG
This paper gives a brief description of the recent improvements of lpg, a programming language that integrates algebraic and logic programming paradigms. In this language, functions are deened by means of constructor-based conditional term rewriting systems and predicates are deened by means of Horn clauses where the bodies may contain classical literals as well as equations and negations of eq...
متن کاملCombining Symbolic Constraint Solvers on Algebraic Domains
(Received) In the context of constraint logic programming and theorem proving, the development of constraint solvers on algebraic domains and their combination is of prime interest. As an example, a constraint solver in nite algebras is presented for a constraint language including for instance equations, disequations and inequations. By extending techniques used for the combination of uniicati...
متن کاملA Constraint Solver in Nite Algebras and Its Combination with Uniication Algorithms
In the context of constraint logic programming and theorem proving, the development of constraint solvers on algebraic domains and their combination is of prime interest. A constraint solver in nite algebras is presented for a constraint language including equations, disequations and inequations on nite domains. The method takes advantage of the embedding of a nite algebra in a primal algebra t...
متن کاملA Constraint Solver in Finite Algebras and Its Combination with Unification Algorithms
In the context of constraint logic programming and theorem proving, the development of constraint solvers on algebraic domains and their combination is of prime interest. A constraint solver in nite algebras is presented for a constraint language including equations, disequations and inequations on nite domains. The method takes advantage of the embedding of a nite algebra in a primal algebra t...
متن کاملSystems integrating answer set programming and constraint programming
We will demonstrate two systems implementing subclasses of a new language AC(C). The language AC(C) not only has the problem modeling power of both Answer Set Prolog (ASP) and Constraint Logic Programming (CLP) but also allows for more efficient inference algorithms combining reasoning techniques from ASP and CLP systems.
متن کامل